翻訳と辞書 Words near each other ・ Berlare ・ Berlats ・ Berlaymont building ・ Berle ・ Berle (surname) ・ Berle Adams ・ Berle Church ・ Berle M. Schiller ・ Berle Sanford Rosenberg ・ Berle-Kari ・ Berlebecke ・ Berleburg Bible ・ Berlei ・ Berlei Building ・ Berlekamp's algorithm ・ Berlekamp–Massey algorithm ・ Berlekamp–Welch algorithm ・ Berlekamp–Zassenhaus algorithm ・ Berleman House ・ Berlencourt-le-Cauroy ・ Berlenga Grande Island ・ Berlengas ・ Berlengas Natural Reserve ・ Berlengas River ・ Berlens ・ Berlenti Abdul Hamid ・ Berlepsch ・ Berlepsch's canastero ・ Berlepsch's tinamou ・ Berles-au-Bois Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Berlekamp–Massey algorithm ： ウィキペディア英語版 Berlekamp–Massey algorithm The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence. The algorithm will also find the minimal polynomial of a linearly recurrent sequence in an arbitrary field. The field requirement means that the Berlekamp–Massey algorithm requires all non-zero elements to have a multiplicative inverse. Reeds and Sloane offer an extension to handle a ring. Elwyn Berlekamp invented an algorithm for decoding Bose–Chaudhuri–Hocquenghem (BCH) codes.〔. Previous publisher McGraw-Hill, New York, NY.〕 James Massey recognized its application to linear feedback shift registers and simplified the algorithm. Massey termed the algorithm the LFSR Synthesis Algorithm (Berlekamp Iterative Algorithm), but it is now known as the Berlekamp–Massey algorithm. ==Description of algorithm== The Berlekamp–Massey algorithm is an alternate method to solve the set of linear equations described in Reed–Solomon Peterson decoder, which can be summarized as: :$S\_\; +\; \backslash Lambda\_1\; S\_\; +\; \backslash cdots\; +\; \backslash Lambda\_\; S\_\; +\; \backslash Lambda\_\; S\_i\; =\; 0.$ In the code examples below, C(x) is a potential instance of Λ(x). The error locator polynomial C(x) for ''L'' errors is defined as: :$C(x)\; =\; C\_\; \backslash \; x^\; +\; C\_\; \backslash \; x^\; +\; \backslash cdots\; +\; C\_2\; \backslash \; x^2\; +\; C\_1\; \backslash \; x\; +\; 1$ or reversed: :$C(x)\; =\; 1\; +\; C\_1\; \backslash \; x\; +\; C\_2\; \backslash \; x^2\; +\; \backslash cdots\; +\; C\_\; \backslash \; x^\; +\; C\_\; \backslash \; x^.$ The goal of the algorithm is to determine the minimal degree ''L'' and C(x) which results in: :$S\_\; +\; C\_1\; \backslash \; S\_\; +\; \backslash cdots\; +\; C\_L\; \backslash \; S\_\; =\; 0$ for all syndromes, ''n'' = ''L'' to (''N''-1). Algorithm: C(x) is initialized to 1, ''L'' is the current number of assumed errors, and initialized to zero. ''N'' is the total number of syndromes. ''n'' is used as the main iterator and to index the syndromes from 0 to (''N''-1). B(x) is a copy of the last C(x) since ''L'' was updated and initialized to 1. ''b'' is a copy of the last discrepancy ''d'' (explained below) since ''L'' was updated and initialized to 1. ''m'' is the number of iterations since ''L'', B(x), and ''b'' were updated and initialized to 1. Each iteration of the algorithm calculates a discrepancy ''d''. At iteration ''k'' this would be: :$d\; =\; S\_\; +\; C\_1\; \backslash \; S\_\; +\; \backslash cdots\; +\; C\_L\; \backslash \; S\_.$ If ''d'' is zero, the algorithm assumes that C(x) and L are correct for the moment, increments ''m'', and continues. If ''d'' is not zero, the algorithm adjusts C(x) so that a recalculation of ''d'' would be zero: :$C(x)\; =\; C(x)\; \backslash \; -\; \backslash \; (d\; /\; b)\; \backslash \; x^m\; \backslash \; B(x).$ The xm term ''shifts'' B(x) so it follows the syndromes corresponding to 'b'. If the previous update of L occurred on iteration ''j'', then ''m = k - j'', and a recalculated discrepancy would be: :$d\; =\; S\_\; +\; C\_1\; \backslash \; S\_\; +\; \backslash cdots\; -\; (d/b)\; (S\_\; +\; B\_1\; \backslash \; S\_\; +\; \backslash cdots\; ).$ This would change a recalculated discrepancy to: :$d\; =\; d\; -\; (d/b)b\; =\; d\; -\; d\; =\; 0.\; \backslash$ The algorithm also needs to increase ''L'' (number of errors) as needed. If ''L'' equals the actual number of errors, then during the iteration process, the discrepancies will become zero before ''n'' becomes greater than or equal to (2 ''L''). Otherwise L is updated and algorithm will update B(x), b, increase L, and reset m = 1. The formula L = (n + 1 - L) limits L to the number of available syndromes used to calculate discrepancies, and also handles the case where L increases by more than 1. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Berlekamp–Massey algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.